Imbalances in k-colorations

نویسندگان

  • Paul Erdös
  • Joel H. Spencer
چکیده

1. INTRODUCTION The following problem is due to Paul Erdijs tll. Color the edges of a complete graph K on n vertices red and blue. What n is the largest t such that we may always find a complete subgraph in which I# red edges-# blue edges1 Lt? We need a more precise and more general formulation. For any set V, define Vk = {W :, w&V, Iwl = k). (1) Note that V2 is the complete graph generated by V. Vk is called the complete k-graph generated by V. The elements of Vk are i~ll~dn~-~~~~~enW~yC~l~~pthe k-edges. A coloring of a set A, 'k : Ak-+ (+l,-1). The values +l,-1 may be thought of as Red and Blue. The sub-script k indicates a function on k-edges and will be dropped when there is no confusion. The function g k induces another function, also denoted by gk, on the subsets of A given by Set gk@) =

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Twisted bi-layer graphene: microscopic rainbows.

Blue, pink, and yellow colorations appear from twisted bi-layer graphene (tBLG) when transferred to a SiO2 /Si substrate (SiO2 = 100 nm-thick). Raman and electron microscope studies reveal that these colorations appear for twist angles in the 9-15° range. Optical contrast simulations confirm that the observed colorations are related to the angle-dependent electronic properties of tBLG combined ...

متن کامل

Quadrangulations and 2-colorations

Any metric quadrangulation (made by segments of straight line) of a point set in the plane determines a 2-coloration of the set, such that edges of the quadrangulation can only join points with different colors. In this work we focus in 2-colorations and study whether they admit a quadrangulation or not, and whether, given two quadrangulations of the same 2-coloration, it is possible to carry o...

متن کامل

Function of being colorful in web spiders: attracting prey or camouflaging oneself?

Bright body colorations of orb-weaving spiders have been hypothesized to be attractive to insects and thus function to increase foraging success. However, the color signals of these spiders are also considered to be similar to those of the vegetation background, and thus the colorations function to camouflage the spiders. In this study, we evaluated these 2 hypotheses by field experiments and b...

متن کامل

Chromatic Scheduling

Variations and extensions of the basic vertex-colouring and edge-colouring models have been developed to deal with increasingly complex scheduling problems. We present and illustrate them in specific situations where additional requirements are imposed. We include list-colouring, mixed graph colouring, co-colouring, colouring with preferences, bandwidth colouring, and present applications of ed...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Networks

دوره 1  شماره 

صفحات  -

تاریخ انتشار 1971